/**
 * Created with IntelliJ IDEA.
 * Description:
 * User: jzj
 * Date: 2024-03-25
 * Time: 18:40
 */
public class test_1 {
    public static int uniquePaths(int m, int n) {
        // 1. 创建 dp 表
        int[][] dp = new int[m][n];
        // 2. 初始化
        for (int i = 0; i < m; i++) {
            dp[i][0] = 1;
        }
        for (int i = 0; i < n; i++) {
            dp[0][i] = 1;
        }
        // 3. 填表
        for (int i = 1; i < m; i++) {
            for (int j = 1; j < n; j++) {
                dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
            }
        }
        // 4. 返回值
        return dp[m - 1][n - 1];


    }

    public static void main(String[] args) {
        System.out.println(uniquePaths(3, 7));
    }
}
